Integer factorization algorithms - PDFSEARCH.IO - Document Search Engine

Integer factorization algorithms
Results: 208

#	Item
11	FACTORIZATION TECHNIQUES ELVIS NUNEZ AND CHRIS SHAW Abstract. The security of the RSA public key cryptosystem relies upon the computational difficulty of deriving the factors of a particular semiprime modulus. In this pa Add to Reading List Source URL: davidlowryduda.com Language: English - Date: 2016-05-25 03:59:31 Integer factorization algorithms Mathematics Cryptography Number theory Quadratic sieve Euclidean algorithm RSA Prime number Factorization Trial division General number field sieve Rational sieve
12	Introduction to Number Theory Supplement on Gaussian Integers Spring 2016 Last Updated: April 10, 2016 This is a brief supplemental note on the Gaussian integers, written for my Add to Reading List Source URL: davidlowryduda.com Language: English - Date: 2016-04-10 04:24:41 Mathematics Algebra Abstract algebra Ring theory Algebraic number theory Commutative algebra Integer factorization algorithms Greatest common divisor Euclidean algorithm Unique factorization domain Factorization Gaussian integer
13	POST-SIEVING ON GPUs Andrea Miele1, Joppe W. Bos2, Thorsten Kleinjung1, Arjen K. Lenstra1 1LACAL, Add to Reading List Source URL: caramba.loria.fr Language: English - Date: 2016-06-13 15:37:34 Computing Computer architecture Computer hardware Graphics hardware Video cards Parallel computing GPGPU Integer factorization algorithms Fermi General number field sieve CUDA General-purpose computing on graphics processing units
14	Edwards Curves and the ECM Factorisation Method Peter Birkner Eindhoven University of Technology The 12th Workshop on Elliptic Curve Cryptography Add to Reading List Source URL: www.hyperelliptic.org Language: English - Date: 2008-09-27 14:59:29 Abstract algebra Algebra Mathematics Finite fields Integer factorization algorithms Group theory Elliptic curve cryptography Lenstra elliptic curve factorization Elliptic curves Elliptic curve Torsion Order
15	Integer Factorization and Computing Discrete Logarithms in Maple Aaron Bradford∗, Michael Monagan∗, Colin Percival∗ , , Department of Mathematics, Simon Fr Add to Reading List Source URL: www.daemonology.net Language: English - Date: 2006-05-14 06:12:35 Cryptography Integer factorization algorithms Mathematics Abstract algebra Quadratic sieve General number field sieve Prime number Safe prime Discrete logarithm RSA Sieve of Atkin Quadratic residue
16	Quantum Computing and Cryptography Spring Semester 2011 Steve Vickers The University of Birmingham School of Computer Science Add to Reading List Source URL: www.cs.bham.ac.uk Language: English - Date: 2011-03-23 04:16:10 Electronic commerce Integer factorization algorithms RSA Prime number Modular arithmetic Coprime Euclidean algorithm Greatest common divisor Cryptography Mathematics Public-key cryptography
17	CS 70 Fall 2003 Discrete Mathematics for CS Wagner Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2015-01-21 19:48:43 Computational number theory Modular arithmetic Multiplication Euclidean algorithm Greatest common divisor Multiplicative inverse Coprime Modulo operation Extended Euclidean algorithm Mathematics Integer factorization algorithms Number theory
18	CS 70 Spring 2008 Discrete Mathematics for CS David Wagner Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2015-01-21 19:48:43 Integer factorization algorithms Euclidean algorithm Greatest common divisor Coprime Multiplicative inverse Modulo operation Recursion Extended Euclidean algorithm Modular multiplicative inverse Mathematics Number theory Modular arithmetic
19	Square Root Algorithms for the Number Field Sieve Emmanuel Thomé INRIA Nancy, Villers-lès-Nancy, France Abstract. We review several methods for the square root step of the Add to Reading List Source URL: www.loria.fr Language: English - Date: 2012-11-29 10:44:38 Integer factorization algorithms Polynomials Field theory Algebraic number theory General number field sieve Special number field sieve Algebraic number field Elliptic curve Prime number Abstract algebra Mathematics Algebra
20	Discrete logarithm in GFwith FFS Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, Emmanuel Thomé, Marion Videau, and Paul Zimmermann CARAMEL project-team, LORIA, INRIA / CNRS / Add to Reading List Source URL: www.loria.fr Language: English - Date: 2014-01-09 15:35:58 Finite fields Logarithms Group theory Integer factorization algorithms Cryptography Index calculus algorithm XTR Polynomial Discrete logarithm Abstract algebra Mathematics Algebra